A parallel distributed data CPHF algorithm for analytic Hessians

نویسندگان

  • Yuri Alexeev
  • Michael W. Schmidt
  • Theresa L. Windus
  • Mark S. Gordon
چکیده

One of the most commonly used means to characterize potential energy surfaces of reactions and chemical systems is the Hessian calculation, whose analytic evaluation is computationally and memory demanding. A new scalable distributed data analytic Hessian algorithm is presented. Features of the distributed data parallel coupled perturbed Hartree-Fock (CPHF) are (a) columns of density-like and Fock-like matrices are distributed among processors, (b) an efficient static load balancing scheme achieves good work load distribution among the processors, (c) network communication time is minimized, and (d) numerous performance improvements in analytic Hessian steps are made. As a result, the new code has good performance which is demonstrated on large biological systems.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Parallelization of analytical Hartree±Fock and density functional theory Hessian calculations. Part I: parallelization of coupled- perturbed Hartree±Fock equations

Solving the coupled-perturbed Hartree±Fock (CPHF) equations is the most time consuming part in the analytical computation of second derivatives of the molecular energy with respect to the nuclei. This paper describes a unique parallelization approach for solving the CPHF equations. The computational load is divided by the nuclear perturbations and distributed evenly among the computing nodes. T...

متن کامل

Static Task Allocation in Distributed Systems Using Parallel Genetic Algorithm

Over the past two decades, PC speeds have increased from a few instructions per second to several million instructions per second. The tremendous speed of today's networks as well as the increasing need for high-performance systems has made researchers interested in parallel and distributed computing. The rapid growth of distributed systems has led to a variety of problems. Task allocation is a...

متن کامل

A Message-Passing Distributed Memory Parallel Algorithm for a Dual-Code Thin Layer, Parabolized Navier-Stokes Solver

In this study, the results of parallelization of a 3-D dual code (Thin Layer, Parabolized Navier-Stokes solver) for solving supersonic turbulent flow around body and wing-body combinations are presented. As a serial code, TLNS solver is very time consuming and takes a large part of memory due to the iterative and lengthy computations. Also for complicated geometries, an exceeding number of grid...

متن کامل

Parallel Unrestricted MP2 Analytic Gradients Using the Distributed Data Interface

A scalable distributed-data parallel analytic gradient algorithm for unrestricted second-order Møller−Plesset perturbation theory is presented. Features of the implementation using the Distributed Data Interface are discussed in detail. Benchmark timing calculations on a parallel cluster system are presented for a variety of gold cluster molecules. The speedups, parallel efficiencies, and perce...

متن کامل

Green Energy-aware task scheduling using the DVFS technique in Cloud Computing

Nowdays, energy consumption as a critical issue in distributed computing systems with high performance has become so green computing tries to energy consumption, carbon footprint and CO2 emissions in high performance computing systems (HPCs) such as clusters, Grid and Cloud that a large number of parallel. Reducing energy consumption for high end computing can bring various benefits such as red...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Journal of computational chemistry

دوره 28 10  شماره 

صفحات  -

تاریخ انتشار 2007